Constrained Delaunay Triangulation using Plane Subdivision
نویسنده
چکیده
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm presents a method for inserting edges, already proposed by Anglada. The algorithm is fast and efficient and therefore appropriate for GIS applications.
منابع مشابه
Apply ing Two-d imens iona l De launay Triangulat ion to Stereo Data Interpolat ion
A b s t r a c t . Interpolation of 3D segments obtained through a trinocular stereo process is achieved by using a 2D Delannay triangulation on the image plane of one of the vision system cameras. The resulting two-dimensional triangulation is backprojected into the 3D space, generating a surface description in terms of triangular faces. The use of a constrained Delaunay triangulation in the im...
متن کاملDelaunay Triangulations and the Radiosity Approach
The radiosity approach requires the subdivision of complex surfaces into simple components called patches. Since we assume to have constant intensity over a patch, the generation of regular patches is a desirable property of the subdivision algorithm. We show that constrained Delaunay triangulations produce patches that are as close to equilateral triangles as possible and thus are well suited ...
متن کاملProgressive Previewing of Ray-Traced Images Using Image-Plane Discontinuity Meshing
This paper presents a new method for progressively previewing a raytraced image while it is being computed. Our method constructs and incrementally updates a constrained Delaunay triangulation of the image plane. The points in the triangulation correspond to all of the image samples that have been computed by the ray tracer, and the constraint edges correspond to various important discontinuity...
متن کاملA Robust Intersection Algorithm Based on Delaunay Triangulation
The paper presents a new robust method for finding points of intersection of line segments in the plane. In this method the subdivision of the plane based on the Delaunay triangulation plays the main role. First, the Delaunay triangulation spanning the end points of line segments is constructed. Next, for line segments that are not realized by Delaunay edges, midpoints are inserted recursively ...
متن کاملMinimal Set of Constraints for 2D Constrained Delaunay Reconstruction
Given a triangulation T of n points in the plane, we are interested in the minimal set of edges in T such that T can be reconstructed from this set (and the vertices of T ) using constrained Delaunay triangulation. We show that this minimal set consists of the non locally Delaunay edges of T , and that its cardinality is less than or equal to n+ i=2 (if i is the number of interior points in T )...
متن کامل